On k-Enclosing Objects in a Coloured Point Set
نویسندگان
چکیده
We introduce the exact coloured k-enclosing object problem: given a set P of n points in R, each of which has an associated colour in {1, . . . , t}, and a vector c = (c1, . . . , ct), where ci ∈ Z for each 1 ≤ i ≤ t, find a region that contains exactly ci points of P of colour i for each i. We examine the problems of finding exact coloured k-enclosing axis-aligned rectangles, squares, discs, and two-sided dominating regions in a t-coloured point set.
منابع مشابه
Persistent K-Means: Stable Data Clustering Algorithm Based on K-Means Algorithm
Identifying clusters or clustering is an important aspect of data analysis. It is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. It is a main task of exploratory data mining, and a common technique for statistical data analysis This paper proposed an improved version of K-Means algorithm, namely Persistent K...
متن کاملComparing Model-based Versus K-means Clustering for the Planar Shapes
In some fields, there is an interest in distinguishing different geometrical objects from each other. A field of research that studies the objects from a statistical point of view, provided they are invariant under translation, rotation and scaling effects, is known as the statistical shape analysis. Having some objects that are registered using key points on the outline...
متن کاملSmallest Color-Spanning Objects
Motivated by questions in location planning, we show for a set of colored point sites in the plane how to compute the smallest (by perimeter or area) axis-parallel rectangle, the narrowest strip, and other smallest objects enclosing at least one site of each color.
متن کاملCrossings and Nestings for Arc-Coloured Permutations and Automation
Symmetric joint distribution between crossings and nestings was established in several combinatorial objects. Recently, Marberg extended Chen and Guo’s result on coloured matchings to coloured set partitions following a multi-dimensional generalization of the bijection and enumerative methods from Chen, Deng, Du, Stanley, and Yan. We complete the study for arc-coloured permutations by establish...
متن کاملSmallest Enclosing Ball for a Point Set with Strictly Convex Level Sets
Let the center point be the point that minimizes the maximum distance from a point of a given point set to the center point. Finding this center point is referred to as the smallest enclosing ball problem. In case of points with Euclidean distance functions, the smallest enclosing ball is actually the center of a geometrical ball. We consider point sets with points that have distance functions ...
متن کامل